%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : SET063^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  7 10:48:59 EDT 2024

% Result   : Theorem 2.48s 1.64s
% Output   : Refutation 2.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   7 unt;   2 typ;   0 def)
%            Number of atoms       :   21 (   7 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   20 (   9   ~;   0   |;   0   &;   5   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   1 usr;   1 con; 0-2 aty)
%            Number of variables   :   17 (   8   ^   8   !;   1   ?;  17   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(sk1_type,type,
    sk1: a > $o ).

thf(1,conjecture,
    ! [A: a > $o] :
      ( ! [B: a] :
          ( ( A @ B )
         => $false )
     => ( A
        = ( ^ [B: a] : $false ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_30_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > $o] :
        ( ! [B: a] :
            ( ( A @ B )
           => $false )
       => ( A
          = ( ^ [B: a] : $false ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ! [A: a > $o] :
        ( ! [B: a] :
            ~ ( A @ B )
       => ( A
          = ( ^ [B: a] : $false ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ! [A: a > $o] :
        ( ~ ? [B: a] : ( A @ B )
       => ( A
          = ( ^ [B: a] : $false ) ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(5,plain,
    ( sk1
   != ( ^ [A: a] : $false ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(7,plain,
    ( sk1
   != ( ^ [A: a] : $false ) ),
    inference(lifteq,[status(thm)],[5]) ).

thf(6,plain,
    ! [A: a] :
      ~ ( sk1 @ A ),
    inference(cnf,[status(esa)],[4]) ).

thf(9,plain,
    ( ( ^ [A: a] : $false )
   != ( ^ [A: a] : $false ) ),
    inference(rewrite,[status(thm)],[7,6]) ).

thf(10,plain,
    $false,
    inference(simp,[status(thm)],[9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : SET063^5 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13  % Command  : run_Leo-III %s %d
% 0.12/0.34  % Computer : n002.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon May  6 20:51:09 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.92/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.15/0.95  % [INFO] 	 Parsing done (121ms). 
% 1.15/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.52/1.21  % [INFO] 	 nitpick registered as external prover. 
% 1.52/1.22  % [INFO] 	 Scanning for conjecture ... 
% 1.67/1.27  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.67/1.30  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.67/1.30  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.67/1.31  % [INFO] 	 Type checking passed. 
% 1.67/1.31  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.48/1.64  % [INFO] 	 Killing All external provers ... 
% 2.48/1.64  % Time passed: 1159ms (effective reasoning time: 672ms)
% 2.48/1.64  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.48/1.64  % Axioms used in derivation (0): 
% 2.48/1.64  % No. of inferences in proof: 9
% 2.48/1.64  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1159 ms resp. 672 ms w/o parsing
% 2.48/1.67  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.48/1.67  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------